package everyday;

/**
 * @author 兴趣使然黄小黄
 * @version 1.0
 * @date 2023/6/17 20:34
 * 2481. 分割圆的最少切割次数
 * https://leetcode.cn/problems/minimum-cuts-to-divide-a-circle/
 */
public class Solution2481 {

    public int numberOfCuts(int n) {
        if (n == 1) {
            return 0;
        }
        if ((n & 1) != 1) {
            return n / 2;
        }
        return n;
    }
}
